Increasing Parallelism in the ROOT I/O Subsystem
نویسندگان
چکیده
منابع مشابه
Optimizing ROOT IO For Analysis
The ROOT I/O (RIO) subsystem is foundational to most HEP experiments it provides a file format, a set of APIs/semantics, and a reference implementation in C++. It is often found at the base of an experiment’s framework and is used to serialize the experiment’s data; in the case of an LHC experiment, this may be hundreds of petabytes of files! Individual physicists will further use RIO to perfor...
متن کاملIncreasing Parallelism for Workflows in the Grid
Workflow applications executed in Grid environments are not able to take advantage of all the potential parallelism they might have. This limitation in the usage of parallelism comes from the fact that when there is a producer/consumer situation communicating using files, the consumer does not start its execution till the producer has finished creating the file to be consumed, and the file has ...
متن کاملExploring compression techniques for ROOT IO
ROOT provides an flexible format used throughout the HEP community. The number of use cases from an archival data format to end-stage analysis has required a number of tradeoffs to be exposed to the user. For example, a high “compression level” in the traditional DEFLATE algorithm will result in a smaller file (saving disk space) at the cost of slower decompression (costing CPU time when read)....
متن کاملCompiling for Increasing On-chip Parallelism
It becomes a trend that microprocessor companies are adding more and more parallelism on a chip to increase performance per chip. At the fine granularity level, vector instruction sets are added. While at the coarse granularity level, multiple cores are put on the same chip. This trend presents a challenge for application developers as well for compiler developers: how to exploit the power of t...
متن کاملIncreasing Instruction-Level Parallelism with Instruction Precomputation
Value reuse improves a processor’s performance by dynamically caching the results of previous instructions and reusing those results to bypass the execution of future instructions that have the same opcode and input operands. However, continually replacing the least recently used entries could eventually fill the value reuse table with instructions that are not frequently executed. Furthermore,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2018
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1085/3/032014